Note on some upper bounds for the condition number
نویسندگان
چکیده
منابع مشابه
Note on Some Upper Bounds for the Condition Number
In this letter, some lower bounds for the smallest singular value of the nonsingular matrix are established. In addition, we also proposed some upper bounds on the condition number of a matrix which are the better than the bound proposed by Guggenheimer et al. [College Math. J. 26(1) (1995) 2-5]. To illustrate our bounds, some examples are also given.
متن کاملNote on Upper Bounds for TSP Domination Number
The Asymmetric Traveling Salesman Problem (ATSP) is stated as follows. Given a weighted complete digraph (K∗ n, w), find a Hamilton cycle (called a tour) in K∗ n of minimum cost. Here the weight function w is a mapping from A(K∗ n), the set of arcs in K∗ n, to the set of reals. The weight of an arc xy of K∗ n is w(x, y). The weight w(D) of a subdigraph D of K∗ n is the sum of the weights of arc...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملUpper Bounds on the Radio Number of Some Trees
Abstract: Let G be a simple,connected and undirected graph with diameter d. For a positive integer k (≤ d), a radio k-labeling f of G is an assignment of non-negative integers, called labels to the vertices of G such that if u, v ∈ V (G) are distinct then d(u, v) + |f(u) − f(v)| ≥ k + 1 where d(u, v) is the distance between u and v. The maximum label (positive integer) assigned by f to some ver...
متن کاملSome Upper Bounds for Signed Star Domination Number of Graphs
Let G be a graph with the vertex set V (G) and edge set E(G). A function f : E(G) → {−1,+1} is said to be a signed star dominating function ofG if ∑ e∈EG(v) f(e) ≥ 1, for every v ∈ V (G), where EG(v) = {uv ∈ E(G) |u ∈ V (G)}. The minimum of the values of ∑ e∈E(G) f(e), taken over all signed star dominating functions f on G is called the signed star domination number of G and is denoted by γss(G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Inequalities
سال: 2014
ISSN: 1846-579X
DOI: 10.7153/jmi-08-27